package dst.graph.explorer;

import dst.graph.GraphNode;
import dataStructures.list.Queue;
import dst.graph.GraphSearchable;

/**
 *
 * @param <T> 
 * @author Shimu
 */
public class QueueExplorer<T> implements TreeExplorer<T> {

    private Queue<GraphSearchable<T>> nodeQueue;

    public QueueExplorer() {
        nodeQueue = new Queue<GraphSearchable<T>>();
    }

    public Queue<GraphSearchable<T>> getNodeQueue() {
        return nodeQueue;
    }

    public boolean exploreCurrent(GraphSearchable<T> node) {
        nodeQueue.enqueue(node);
        return false;
    }
}
